Planar Families of Discrete Groups

نویسندگان

  • JANE GILMAN
  • LINDA KEEN
چکیده

Determining the space of free discrete two generator groups of Möbius transformations is an old and difficult problem. In this paper we show how to construct large balls of full dimension in this space. To do this, we begin with a marked discrete group of non-separating disjoint circle type, nsdc group (see section 2.2 for the definition). Such a group determines three disjoint or tangent planes. We prove that there is a whole family of discrete groups, which we term the nsdc-planar family, that share these planes. From specific information about the nsdc planes which depends on the marking data, we show how to construct all the discrete groups in the nsdc planar family. In particular, we find a set of six real numbers that serve as parameters for this family. We then construct an embedding of our parameters into a classical representation of the full space of free discrete groups as a subset of Ĉ. We see that each planar family fills out a ball of full dimension in the classical embedding. We remark that our construction does not use the usual theory of quasi-conformal deformations of a given group nor does it depend simply on the use of coverings and quotients that give commensurable groups. The paper is organized as follows. In section 2 we give the basic notation and definitions and in section 3 we define the nsdc planar family. Sections 4 and 5 develop computational techniques and in section 6 we construct our new parameters. In section 7 we show how to our parameters are related to the classical parameters. Finally, in section 8 we give a necessary and sufficient condition for a marked group to belong to a given planar family.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Competitive Facility Location Problem in a Discrete Planar Space

In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...

متن کامل

On the M-polynomial of planar chemical graphs

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

متن کامل

LR Characterization of Chirotopes of Finite Planar Families of Pairwise Disjoint Convex bodies

We extend the classical characterization of chirotopes of finite planar families of points—which says that a map χ defined on the set of triples of a finite indexing set I is the chirotope of a finite planar family of points if and only if for every 3-, 4-, and 5-subset J of I the restriction of χ to the set of triples of J is the chirotope of a finite planar family of points—to chirotopes of f...

متن کامل

SYMBIOTIC ORGANISMS SEARCH AND HARMONY SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION OF STRUCTURES

In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...

متن کامل

2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs

In this paper, we improve the existing bounds [2] for 2-dipath and oriented L(2, 1) span for the class of planar graphs with girth 5, 11, 16, cactus, wheels and leaf independent Halin graphs. Some of these bounds are tight.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005